Succession rules and Deco polyominoes
نویسندگان
چکیده
منابع مشابه
Recurrence relations versus succession rules
In this paper we present a method to pass from a recurrence relation having constant coefficients (in short, a C-recurrence) to a finite succession rule defining the same number sequence. We recall that succession rules are a recently studied tool for the enumeration of combinatorial objects related to the ECO method. We also discuss the applicability of our method as a test for the positivity ...
متن کاملA Note on Rational Succession Rules
Succession rules having a rational generating function are usually called rational succession rules. In this note we discuss some problems concerning rational succession rules, and determine a simple method to pass from a rational generating function to a rational succession rule, both defining the same number sequence. 2
متن کاملMixed succession rules: The commutative case
We begin a systematic study of the enumerative combinatorics of mixed succession rules, which are succession rules such that, in the associated generating tree, the nodes are allowed to produce their sons at several different levels according to different production rules. Here we deal with a specific case, namely that of two different production rules whose rule operators commute. In this situ...
متن کاملOn the equivalence problem for succession rules
The notion of succession rule (system for short) provides a powerful tool for the enumeration of many classes of combinatorial objects. Often, different systems exist for a given class of combinatorial objects, and a number of problems arise naturally. An important one is the equivalence problem between two different systems. In this paper, we show how to solve this problem in the case of syste...
متن کاملRecurrence Relations, Succession Rules, and the Positivity Problem
In this paper we present a method to pass from a given recurrence relation with constant coefficients (in short, a C-finite recurrence) to a finite succession rule defining the same number sequence. Our method consists in two steps: first, we transform the given recurrence relation into an extended succession rule, then we provide a series of operations to reduce such an extended succession rul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 2000
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita:2000103